A three-layer joint distributionally robust chance-constrained framework for optimal day-ahead scheduling of e-mobility ecosystem

نویسندگان

چکیده

A high number of electric vehicles (EVs) in the transportation sector necessitates an advanced scheduling framework for e-mobility ecosystem operation as a whole order to overcome range anxiety and create viable business model charging stations (CSs). The must account stochastic nature all stakeholders' operations, including EV drivers, CSs, retailers their mutual interactions. In this paper, three-layer joint distributionally robust chance-constrained (DRCC) is proposed plan grid-to-vehicle (G2V) vehicle-to-grid (V2G) day-ahead ecosystems. does not rely on specific probability distribution parameters. To solve problem, iterative process using DRCC formulation. achieve computational traceability, exact reformulation implemented double-sided single-sided chance constraints (CCs). Furthermore, impact temporal correlation uncertain PV generation CSs considered. simulation study carried out three retailers, nine 600 EVs based real data from San Francisco, USA. results show necessity applicability such method environment, e.g., by reducing unique that failed reach destination 272 61.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On distributionally robust joint chance-constrained problems

Introduction: A chance constrained optimization problem involves constraints with stochastic data that are required to be satisfied with a pre-specified probability. When the underlying distribution of the stochastic data is not known precisely, an often used model is to require the chance constraints to hold for all distributions in a given family. Such a problem is known as a distributionally...

متن کامل

Chance-Constrained Day-Ahead Hourly Scheduling in Distribution System Operation

This paper aims to propose a two-step approach for day-ahead hourly scheduling in a distribution system operation, which contains two operation costs, the operation cost at substation level and feeder level. In the first step, the objective is to minimize the electric power purchase from the day-ahead market with the stochastic optimization. The historical data of dayahead hourly electric power...

متن کامل

Distributionally robust chance-constrained linear programs

In this paper, we discuss linear programs in which the data that specify the constraints are subject to random uncertainty. A usual approach in this setting is to enforce the constraints up to a given level of probability. We show that for a wide class of probability distributions (i.e. radial distributions) on the data, the probability constraints can be explicitly converted into convex second...

متن کامل

On Distributionally Robust Chance-Constrained Linear Programs1

In this paper, we discuss linear programs in which the data that specify the constraints are subject to random uncertainty. A usual approach in this setting is to enforce the constraints up to a given level of probability. We show that, for a wide class of probability distributions (namely, radial distributions) on the data, the probability constraints can be converted explicitly into convex se...

متن کامل

Distributionally Robust Chance-Constrained Bin Packing

Chance-constrained bin packing problem allocates a set of items into bins and, for each bin, bounds the probability that the total weight of packed items exceeds the bin’s capacity. Different from the stochastic programming approaches relying on full distributional information of the random item weights, we assume that only the information of the mean and covariance matrix is available. Accordi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Energy

سال: 2023

ISSN: ['0306-2619', '1872-9118']

DOI: https://doi.org/10.1016/j.apenergy.2022.120402